搜索资源列表
A Prime Number Generator
- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be becau
1002
- Sicily上的1002题，主要是为一些初学者设计的-Problem Given a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rearrangement of these integers so that each adjacent pair of integers sums to a composite (non-prime) number. For example, if
PrimeGenAndTester
- Very large (tested for more than 2048 bits) prime number generator and tester program. This is well written and based on solid algorithms in this field. Source code is my own, used for Masters course in Cryptography. Program has easily readable and
prime
- 快速求素数，用到了概率算法。可以求出相当大范围内的素数，远远优于普通的素数算法-Fast seek primes, using a probability algorithm. Can be obtained within the scope of a large prime number, which is far superior to an ordinary prime number algorithm
prime
- 质性测试，小于32767一个最小的质数，使用PASCAL编写-Qualitative test, less than 32767 to one of the least prime number
single-number
- 这是一个求素数的程序，并且同时存在编译错误和运行错误。编译错误是指程序编译过程中出现的一些语法错误，VC++的功能强大，能较为准确的定位，纠错较为方便，而运行错误是在运行过程中，比如该题中在边界值附近运行时的溢出错。-This is a prime number for the procedure, and exist simultaneously compile error and run error. Compiler compiler refers to the procedural er
prime
- 一个求解素数的算法小程序！为初学者了解语法功能与结构使用- A prime number of algorithms for solving applet
prime
- 快速计算出质数-Quickly calculate the prime number
prime
- 利用数学的概念来检查任意输入数值是否为质数-The concept of the use of mathematics to check whether any numerical input prime number
5_prime_algorithm_compare
- 5种N自然数内素数算法速度比较 第一个是普通的筛选法处理,基本1000以后就挂了-5 kinds of natural number N with the rate of prime number algorithm
prime
- 求任意一个整数是不是素数。采用for循环分别用改数除以它和1之间的所有数。最后给出结果。-For any prime number is an integer. Used for the cycle were divided by the number changed between it and all the number 1. Finally, the results.
prime
- A prime number code .
sushu
- 输入一个数 然后可以得到比这个数小的所有素数 InTEL汇编程序设计书后的一道题目 天津大学实验 -Enter a number and then can get smaller than this number of all prime numbers InTEL assembly programming book for a test subject of Tianjin University
primeno
- how to detect a prime number using VHDL
prime
- 一是利用计算机对正整数进行素因子分解认识素数，通过运用筛法与试除法寻找一定范围内的素数，体会到筛法比试除法有效但无法找出所有素数；二是通过若干特殊形式的素数的研究，寻找素数生成公式，发现一些结论；三是借助于非线性拟合技术，观察素数分布规律，利用其研究有关数论问题。-The first computer was used to prime factor decomposition of positive integers understanding of prime numbers, throug
prime-number
- 输入一个正整数，结果输出小于这个整数的所有素数-prime number
output-prime-number
- 判断101-200之间有多少个素数，并输出所有素数。-output100-200 prime number
Prime search
- 素数查找功能的程序，适用于C语言。质数（prime number）又称素数，有无限个。质数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数，这样的数称为质数(The prime search function program is suitable for C language. Prime number, also known as prime number, there are infinite. The prime number is defined as a natural n
Prime-Number-before50
- 简易版-找从2到50的质数。只用了余数来判断，没有用到平方根作为判断条件，有待升级。编程软件用的是C-Free 5(The simple version- To find prime number from 2 to 50)
prime
- sequence prime number